On the Doubling Algorithm for a (Shifted) Nonsymmetric Algebraic Riccati Equation

نویسندگان

  • Chun-Hua Guo
  • Bruno Iannazzo
  • Beatrice Meini
چکیده

Nonsymmetric algebraic Riccati equations for which the four coefficient matrices form an irreducible M -matrix M are considered. The emphasis is on the case where M is an irreducible singular M -matrix, which arises in the study of Markov models. The doubling algorithm is considered for finding the minimal nonnegative solution, the one of practical interest. The algorithm has been recently studied by others for the case where M is a nonsingular M -matrix. A shift technique is proposed to transform the original Riccati equation into a new Riccati equation for which the four coefficient matrices form a nonsingular matrix. The convergence of the doubling algorithm is accelerated when it is applied to the shifted Riccati equation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A structured doubling algorithm for nonsymmetric algebraic Riccati equations (a singular case)

In this paper we propose a structured doubling algorithm (SDA) for the computation of the minimal nonnegative solutions to the nonsymmetric algebraic Riccati equation (NARE) and its dual equation simultaneously, for a singular case. Similar to the Newton’s method we establish a global and linear convergence for SDA under the singular condition, using only elementary matrix theory. Numerical exp...

متن کامل

Performance enhancement of doubling algorithms for a class of complex nonsymmetric algebraic Riccati equations

A new class of complex nonsymmetric algebraic Riccati equations has been studied by Liu & Xue (2012, SIAM J. Matrix Anal. Appl., 33, 569–596), which is related to the M-matrix algebraic Riccati equations. Doubling algorithms, with properly chosen parameters, are used there for equations in this new class. It is pointed out that the number of iterations for the doubling algorithms may be relativ...

متن کامل

A structure-preserving doubling algorithm for nonsymmetric algebraic Riccati equation

In this paper we propose a structure-preserving doubling algorithm (SDA) for computing the minimal nonnegative solutions to the nonsymmetric algebraic Riccati equation (NARE) based on the techniques developed in the symmetric cases. This method allows the simultaneous approximation of the minimal nonnegative solutions of the NARE and its dual equation, only requires the solutions of two linear ...

متن کامل

Solving Large-Scale Nonsymmetric Algebraic Riccati Equations by Doubling

We consider the solution of the large-scale nonsymmetric algebraic Riccati equation XCX − XD − AX + B = 0, with M ≡ [D,−C;−B,A] ∈ R(n1+n2)×(n1+n2) being a nonsingular M-matrix, and A,D being sparse-like (with the products A−1v, A−>v, D−1v and D−>v computable in O(n1) or O(n2) complexity, for some vector v) and B,C are low-ranked. The structure-preserving doubling algorithm by Guo, Lin and Xu (2...

متن کامل

Low-rank approximation to the solution of a nonsymmetric algebraic Riccati equation from transport theory

We consider the solution of the large-scale nonsymmetric algebraic Riccati equation XCX À XD À AX þ B ¼ 0 from transport theory (Juang 1995), with M ½D; ÀC; ÀB; AŠ 2 R 2nÂ2n being a nonsingular M-matrix. In addition, A; D are rank-1 updates of diagonal matrices , with the products A À1 u; A À> u; D À1 v and D À> v computable in OðnÞ complexity, for some vectors u and v, and B, C are rank 1. The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Matrix Analysis Applications

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2007